
function quickSort<T>(arr:any[]):T[]{
    const {length} = arr;
    if(length <= 1){
        return arr
    }
    let provt:any = arr[0]
    let left =[];
    let right =[];
    for(let i = 1 ; i < length ; i++){
        if(provt.fProportion < arr[i].fProportion){
            right.push(arr[i])
        }else{
            left.push(arr[i])
        }
    }
    let l = quickSort<T>(left)
    let r = quickSort<T>(right)
    return r.concat(provt).concat(l)
}
export default quickSort